Authenticated Relational Tables and Authenticated Skip Lists
نویسندگان
چکیده
We present a general method, based on the usage of typical DBMS primitives, for maintaining authenticated relational tables. The authentication process is managed by an application external to the DBMS, that stores just one hash information of the authentication structure. The method exploits techniques to represent hierarchical data structures into relational tables and queries that allow an efficient selection of the elements needed for authentication.
منابع مشابه
On the Cost of Persistence and Authentication in Skip Lists
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical st...
متن کاملEfficient Authenticated Dictionaries with Skip Lists and Commutative Hashing∗
We present an efficient and practical technique for dynamically maintaining an authenticated dictionary. The main building blocks of our scheme are the skip list data structure and cryptographic associative hash functions. Applications of our work include certificate revocation in public key infrastructure and the the publication of data collections on the Internet.
متن کاملImplementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing
We present the software architecture and implementation of an efficient data structure for dynamically maintaining an authenticated dictionary. The building blocks of the data structure are skip lists and one-way commutative hash functions. We also present the results of a preliminary experiment on the performance of the data structure. Applications of our work include certificate revocation in...
متن کاملOn the Cost of Authenticated Data Structures
Authenticated data structures provide a model for data authentication, where answers to queries contain extra information that can produce a cryptographic proof about their validity. In this paper, we study the authentication cost that is associated with this model when authentication is performed through hierarchical cryptographic hashing. We introduce measures that precisely model the computa...
متن کاملAuthenticated Append-only Skip Lists
In this work we describe, design and analyze the security of a tamper-evident, append-only data structure for maintaining secure data sequences in a loosely coupled distributed system where individual system components may be mutually distrustful. The resulting data structure, called an Authenticated Append-Only Skip List (AASL), allows its maintainers to produce one-way digests of the entire d...
متن کامل